Parallelization of Modular Algorithms
نویسندگان
چکیده
منابع مشابه
Parallelization of Modular Algorithms
In this paper we investigate the parallelization of two modular algorithms. In fact, we consider the modular computation of Gröbner bases (resp. standard bases) and the modular computation of the associated primes of a zero–dimensional ideal and describe their parallel implementation in Singular. Our modular algorithms to solve problems over Q mainly consist of three parts, solving the problem ...
متن کاملLoop Parallelization Algorithms
This chapter is devoted to a comparative survey of loop parallelization algorithms. Various algorithms have been presented in the literature, such as those introduced These algorithms make use of diierent mathematical tools. Also, they do not rely on the same representation of data dependences. In this chapter, we survey each of these algorithms, and we assess their power and limitations, both ...
متن کاملParallelization of Image Segmentation Algorithms
With the rapid developments of higher resolution imaging systems, larger image data are produced. To process the increasing image data with conventional methods, the processing time increases tremendously. Image segmentation is one of the many image processing algorithms, and it is widely used in medical imaging (i.e. find tumor in MRI), robotic vision (i.e. vision-based navigation), and face r...
متن کاملChapter 5. Loop Parallelization Algorithms
This chapter is devoted to a comparative survey of loop parallelization algorithms. Various algorithms have been presented in the literature, such as those introduced by Allen and Kennedy, Wolf and Lam, Darte and Vivien, and Feautrier. These algorithms make use of different mathematical tools. Also, they do not rely on the same representation of data dependences. In this chapter, we survey each...
متن کاملOn Parallelization of Static Scheduling Algorithms
| Most static scheduling algorithms that schedule parallel programs represented by directed acyclic graphs (DAGs) are sequential. This paper discusses the essential issues of par-allelization of static scheduling and presents two eecient parallel scheduling algorithms. The proposed algorithms have been implemented on an Intel Paragon machine, and their performance has been evaluated. These algo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Symbolic Computation
سال: 2011
ISSN: 0747-7171
DOI: 10.1016/j.jsc.2011.01.003